A Preliminary Study on Ancestral Voting Algorithm for Availability Improvement of Mutual Exclusion in Partitioned Distributed Systems
نویسندگان
چکیده
Mutual exclusion as one of the main problems associated with distributed systems requires that at any time t, only one site can access the common copies of file f. As a result of node or link failures, distributed system may be partitioned into two or more groups of nodes which cannot communicate each other anymore; meanwhile they must be able to update their copies of file f consistently, in order to keep the system up. Voting algorithms are the main solutions presented to maintain mutual exclusion in case of distributed system partitioning. So far several techniques have been presented to increase the availability of mutual exclusion in partitioned distributed systems. In this paper a new dynamic voting approach called as ancestral voting is presented to increase the availability of distributed system. Our analyses show that this algorithm can maintain mutual exclusion and increase the availability of distributed system between 2.86% and 59.83% in comparison with previous algorithms. Furthermore, it is very simple and does not need many calculations. Key-words: Dynamic Voting Algorithm, Mutual Exclusion, Partitioned Distributed System, Availability
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملVoting without Version Numbers
Voting protocols are widely used to provide mutual exclusion in distributed systems and to guarantee the consistency of replicated data in the presence of network partitions. Unfortunately, the most efficient voting protocols require fairly complex metadata to assert which replicas are up-to-date and to denote the replicas that belong to that set. We present a much simpler technique that does n...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملA Study on the Distributed k-Mutual Exclusion Problem
The distributed k-mutual exclusion problem is the problem of guaranteeing that at most k processes can enter a critical section at a time in a distributed system. The distributed 1-mutual exclusion problem is one of fundamental distributed problems in distributed systems and many algorithms for solving the problem have been proposed. In this paper, we introduce the k-coterie as an extension of ...
متن کامل